Martin Gardner's Minimum No-3-in-a-Line Problem
نویسندگان
چکیده
In Martin Gardner’s October 1976 Mathematical Games column in Scientific American, he posed the following problem: “What is the smallest number of [queens] you can put on an [n× n chessboard] such that no [queen] can be added without creating three in a row, a column, or a diagonal?” We use the Combinatorial Nullstellensatz to prove that this number is at least n. A second, more elementary proof is also offered in the case that n is even.
منابع مشابه
Scheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملThe challenge of extraabdominal desmoid tumour management in patients with Gardner’s syndrome: radiofrequency ablation, a promising option
Desmoid tumours are benign, myofibroblastic stromal neoplasms common in Gardner's syndrome, which is a subtype of familial adenomatous polyposis characterized by colonic polyps, osteomas, thyroid cancer, epidermoid cysts, fibromas and sebaceous cysts. The primary treatment is surgery, followed by adjuvant radiotherapy, but the local recurrence rate is high, and wide resection can result in debi...
متن کاملMeshes Preserving Minimum Feature Size
The minimum feature size of a planar straight-line graph is the minimum distance between a vertex and a nonincident edge. When a polygon is partitioned into a mesh, the degradation is the ratio of original to final minimum feature size. We show that some planar straight-line graphs cannot be triangulated with constant degradation, even with an unbounded number of Steiner points and triangles. T...
متن کاملComputing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if edge crossings are allowed or forbidden. We also show that the problem remains NP-hard even when a minimum-dilation tour or path is sought; not even an FPTAS exists in this case.
متن کاملVillous adenomas and carcinoma of the duodenum in Gardner's syndrome.
Patients with Gardner's syndrome are increasingly found to have polyps on routine upper gastrointestinal endoscopy, and their risk of developing periampullary carcinoma is between 3-12%. We report a 45 year old man with Gardner's syndrome who presented with periampullary carcinoma 5 years after colectomy. Review of the literature amassed another 21 cases of periampullary carcinoma in patients w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The American Mathematical Monthly
دوره 121 شماره
صفحات -
تاریخ انتشار 2014